Unrestricted Algorithms for Elementary and Special Functions
نویسنده
چکیده
Floating-point computations are usually performed with fixed precision: the machine used may have “single” or “double” precision floating-point hardware, or on small machines fixed-precision floating-point operations may be implemented by software or firmware. Most high-level languages support only a small number of floating-point precisions, and those which support an arbitrary number usually demand that the precision be determinable at compile time.
منابع مشابه
THE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
متن کاملMinimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کاملRational Hermite–fejér Interpolation
In this paper we construct rational orthogonal systems with respect to the normalized area measure on the unit disc. The generating system is a collection of so called elementary rational functions. In the one dimensional case an explicit formula exists for the corresponding Malmquist–Takenaka functions involving the Blaschke functions. Unfortunately, this formula has no generalization for the ...
متن کاملPartition Analysis, Modular Functions, and Computer Algebra
This article describes recent developments connecting problems of enumerative combinatorics, constrained by linear systems of Diophantine inequalities, with number theory topics like partitions, partition congruences, and q-series identities. Special emphasis is put on the role of computer algebra algorithms. The presentation is intended for a broader audience; to this end, elementary introduct...
متن کاملModern Computer Arithmetic (version 0.5.1)
This is a draft of a book about algorithms for performing arithmetic, and their implementation on modern computers. We are concerned with software more than hardware - we do not cover computer architecture or the design of computer hardware. Instead we focus on algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to top...
متن کامل